Abstracting Probabilistic Actions
نویسندگان
چکیده
Abstracting Probabilistic Actions Peter Haddawy AnHai Doan Department of Electrical Engineering and Computer Science University of Wisconsin-Milwaukee PO Box 784 Milwaukee, WI 53201 fhaddawy, [email protected] Abstract This paper discusses the problem of abstracting conditional probabilistic actions. We identify two distinct types of abstraction: intra-action abstraction and inter-action abstraction. We de ne what it means for the abstraction of an action to be correct and then derive two methods of intra-action abstraction and two methods of inter-action abstraction which are correct according to this criterion. We illustrate the developed techniques by applying them to actions described with the temporal action representation used in the drips decision-theoretic planner and we describe how the planner uses abstraction to reduce the complexity of planning.
منابع مشابه
Generating Macro Operators for Decision-Theoretic Planning
ion in probabilistic domains has long been rec-ognizedas an effective tool to faciliate faster reasoning.In this paper we focused on the technical side of ob-taining a correct macro abstraction; a comprehensivetheory of abstracting probabilistic actions is presentedin [2]. Empirical results of applying the technique toseveral domains showed substantial reduction in t...
متن کاملAbstracting from Failure Probabilities
ing from Failure Probabilities Jan Jürjens Computing Laboratory, University of Oxford, GB [email protected] – http://www.jurjens.de/jan Abstract In fault-tolerant computing, dependability of systems is usually demonstrated by abstracting from failure probabilities (under simplifying assumptions on failure occurrences). In the specification framework FOCUS, we show under which conditions and t...
متن کاملAn algebraic Approach for Abstracting Belief Networks
This paper investigates an algebraic approach for simplifying belief networks. A network with a simple structure permits eecient probabilistic inference while it preserves probabilistic orderings. A simpliied network introduces extra independence relations to reduce the interconnectivities among the random variables in the network, and thus the cost of probabilistic inference.
متن کاملDecison-Theoretic Refinement Planning using Inheritance Abstraction
Given a probabilistic model of the world and of available actions and a utility function representing the planner’s objectives we wish to find the plan that maximizes expected utility. Finding the optimal plan requires comparing the expected utilities of all possible plans. Doing this explicitly would be computationally prohibitive in all but the smallest of domains. Thus we must find a way to ...
متن کاملA Class of Probabilistic Automata with a Decidable Value 1 Problem
The value 1 problem is a decision problem for probabilistic automata on finite words: given a probabilistic automatonA, are there words accepted byA with probability arbitrarily close to 1? This problem was proved undecidable recently. We introduce a new class of probabilistic automata, called leaktight automata, for which the value 1 problem is decidable. The algorithm is based on the computat...
متن کامل